Self-Stabilizing Routing Protocol for General Networks

Given an asynchronous network with at most nodes we present a self-stabilizing distributed algorithm for routing (nodes can be added or can crash at any time, so their number can vary up to the upper bound n). It starts in some arbitrary state, with no knowledge of the network architecture and eventually builds in each node a correct routing table regarding the t closest neighbors (t depends on the network needs: it can be n when each node needs to know shortest paths to all other nodes, or less when we need only partial knowledge). The size of the table in any node v is O((t + ∆v) log(n)) bits (∆v is the degree of node v), and a total of O(n t log(n)) bits per network. The stabilization time of the algorithm is O(d+c) time units (d is the maximum diameter of the network, and c is a large constant depending on the local computation time of a node).